Hamming metric

См. также в других словарях:

• Hamming bound — In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… …   Wikipedia

• Hamming distance — 3 bit binary cube for finding Hamming distance …   Wikipedia

• Metric (mathematics) — In mathematics, a metric or distance function is a function which defines a distance between elements of a set. A set with a metric is called a metric space. A metric induces a topology on a set but not all topologies can be generated by a metric …   Wikipedia

• String metric — String metrics (also known as similarity metrics) are a class of textual based metrics resulting in a similarity or dissimilarity (distance) score between two pairs of text strings for approximate matching or comparison and in fuzzy string… …   Wikipedia

• Linear code — In mathematics and information theory, a linear code is an important type of block code used in error correction and detection schemes. Linear codes allow for more efficient encoding and decoding algorithms than other codes (cf. syndrome… …   Wikipedia

• Covering code — In coding theory, a covering code is an object satisfying a certain mathematical property: A code of length n over Q is an R covering code if for every word of Qn there is a codeword such that their Hamming distance is . Contents 1 Definition 2… …   Wikipedia

• Window function — For the term used in SQL statements, see Window function (SQL) In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero valued outside of some chosen interval …   Wikipedia

• Norm (mathematics) — This article is about linear algebra and analysis. For field theory, see Field norm. For ideals, see Norm of an ideal. For group theory, see Norm (group). For norms in descriptive set theory, see prewellordering. In linear algebra, functional… …   Wikipedia

• Isoperimetric inequality — The isoperimetric inequality is a geometric inequality involving the square of the circumference of a closed curve in the plane and the area of a plane region it encloses, as well as its various generalizations. Isoperimetric literally means… …   Wikipedia

• Distance — This article is about distance in the mathematical or physical sense. For other senses of the term, see distance (disambiguation). Proximity redirects here. For the 2001 film, see Proximity (film). Distance (or farness) is a numerical description …   Wikipedia

• Levenshtein distance — In information theory and computer science, the Levenshtein distance is a string metric for measuring the amount of difference between two sequences. The term edit distance is often used to refer specifically to Levenshtein distance. The… …   Wikipedia